An adaptive time slot assignment algorithm for variable bandwidth switching systems

In this paper, we consider an optimal (i.e., minimum scheduling length) time slot assignment (for short, TSA) problem in variable bandwidth switching systems. In previous studies, the interdependencies between two consecutive switching con"gurations were neglected. However, it is highly probable that the amount of change between the switching con"gurations will be small. Therefore, it is unnecessary to schedule all tra$c for each con"guration if we preserve the previous switching con"guration and update the switching con"guration appropriately according to changes in tra$c demand. The adaptive TSA algorithm proposed in this paper employs such an idea and reduces the computational burden of "nding switching con"gurations. The computational complexity of the proposed algorithm and simulation results are reported. The results show that our algorithm is more e$cient than existing optimal TSA algorithms.